Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Fair multi-party private set intersection protocol based on cloud server
Jing ZHANG, He TIAN, Kun XIONG, Yongli TANG, Li YANG
Journal of Computer Applications    2023, 43 (9): 2806-2811.   DOI: 10.11772/j.issn.1001-9081.2022081229
Abstract237)   HTML9)    PDF (1675KB)(91)       Save

Private Set Intersection (PSI) is an important solution for privacy information sharing. A fair multi-party PSI protocol based on cloud server was proposed for the unfairness caused by the existing protocols in which the parties involved do not have simultaneous access to the calculation results. Firstly, the storage of a sub-share of the private information in Garbled Bloom Filter (GBF) was accomplished by using hash mapping. Secondly, in order to avoid the leakage of the index value of each party’s set element during the interaction, combined with Oblivious Transfer (OT) technique, the share replacement of the stored information was realized. Finally, the bit-by-bit calculation was performed by the cloud server, and the results were returned to each party at the same time to ensure the fairness of each party’s access to the results. The correctness and security analysis of the protocol shows that the proposed protocol can achieve the fairness of the parties in obtaining the intersection results, and can resist the collusion of parties with the cloud server. The performance analysis shows that both of the computational complexity and the communication complexity of the proposed protocol are independent of the total number of elements contained in the set of participants. Under the same conditions, compared with Multi-party PSI protocol (MPSI) practical multiparty maliciously-secure PSI protocol (PSImple) and Private Intersection Sum algorithm (PI-Sum), the proposed protocol has less storage overhead, communication overhead and running time.

Table and Figures | Reference | Related Articles | Metrics
Video facial landmark tracking by multi-view constrained cascade regression
Shaosheng DAI, Kun XIONG, Yunduo WU, Jiawei XIAO
Journal of Computer Applications    2022, 42 (8): 2415-2422.   DOI: 10.11772/j.issn.1001-9081.2021060996
Abstract271)   HTML8)    PDF (2970KB)(81)       Save

In recent years, the algorithms of detecting facial landmarks in static images have been greatly improved. However, facial landmark detection and tracking are still challenging due to the changes of the factors such as head posture, occlusion and illumination in real videos. In order to solve this problem, a video facial landmark tracking algorithm based on multi-view constrained cascade regression was proposed. Firstly, the 3-dimensional and 2-dimensional sparse point sets were used to establish a transformation relationship and estimate the initial shape. Secondly, due to the large posture difference between face images, affine transformation was used to correct the pose of the face images. When the shape regression model was constructed, the multi-view constrained cascade regression model was used to reduce the shape variance, so that the learned regression model had stronger robustness to the shape variance. Finally, a reinitialization mechanism was adopted, and Normalized Cross Correlation (NCC) template matching tracking algorithm was used to establish the shape relationship between consecutive frames when the feature points were correctly located. The experimental results on the public data set used for testing show that the average error of the proposed algorithm is less than 10% of the interocular distance.

Table and Figures | Reference | Related Articles | Metrics